Gene Therapy in Cardiac Arrhythmias

Gene therapy has progressed from a dream to a bedside reality in quite a few human diseases. From its first application in adenosine deaminase deficiency, through the years, its application has evolved to vascular angiogenesis and cardiac arrhythmias. Gene based biological pacemakers using viral vectors or mesenchymal cells tested in animal models hold much promise. Induction of pacemaker activity within the left bundle branch can provide stable heart rates. Genetic modification of the AV node mimicking beta blockade can be therapeutic in the management of atrial fibrillation. G protein overexpression to modify the AV node also is experimental. Modification and expression of potassium channel genes altering the delayed rectifier potassium currents may permit better management of congenital long QT syndromes. Arrhythmias in a failing heart are due to abnormal calcium cycling. Potential targets for genetic modulation include the sarcoplasmic reticulum calcium pump, calsequestrin and sodium calcium exchanger.Lastly the ethical concerns need to be addressed

Effects of partitioning and scheduling sparse matrix factorization on communication and load balance

A block based, automatic partitioning and scheduling methodology is presented for sparse matrix factorization on distributed memory systems. Using experimental results, this technique is analyzed for communication and load imbalance overhead. To study the performance effects, these overheads were compared with those obtained from a straightforward 'wrap mapped' column assignment scheme. All experimental results were obtained using test sparse matrices from the Harwell-Boeing data set. The results show that there is a communication and load balance tradeoff. The block based method results in lower communication cost whereas the wrap mapped scheme gives better load balance

Idiopathic Fascicular Ventricular Tachycardia

Idiopathic fascicular ventricular tachycardia is an important cardiac arrhythmia with specific electrocardiographic features and therapeutic options. It is characterized by relatively narrow QRS complex and right bundle branch block pattern. The QRS axis depends on which fascicle is involved in the re-entry. Left axis deviation is noted with left posterior fascicular tachycardia and right axis deviation with left anterior fascicular tachycardia. A left septal fascicular tachycardia with normal axis has also been described. Fascicular tachycardia is usually seen in individuals without structural heart disease. Response to verapamil is an important feature of fascicular tachycardia. Rare instances of termination with intravenous adenosine have also been noted. A presystolic or diastolic potential preceding the QRS, presumed to originate from the Purkinje fibers can be recorded during sinus rhythm and ventricular tachycardia in many patients with fascicular tachycardia. This potential (P potential) has been used as a guide to catheter ablation. Prompt recognition of fascicular tachycardia especially in the emergency department is very important. It is one of the eminently ablatable ventricular tachycardias. Primary ablation has been reported to have a higher success, lesser procedure time and fluoroscopy time

Low Power Reversible Parallel Binary Adder/Subtractor

In recent years, Reversible Logic is becoming more and more prominent technology having its applications in Low Power CMOS, Quantum Computing, Nanotechnology, and Optical Computing. Reversibility plays an important role when energy efficient computations are considered. In this paper, Reversible eight-bit Parallel Binary Adder/Subtractor with Design I, Design II and Design III are proposed. In all the three design approaches, the full Adder and Subtractors are realized in a single unit as compared to only full Subtractor in the existing design. The performance analysis is verified using number reversible gates, Garbage input/outputs and Quantum Cost. It is observed that Reversible eight-bit Parallel Binary Adder/Subtractor with Design III is efficient compared to Design I, Design II and existing design.Comment: 12 pages,VLSICS Journa

Drag and inertia coefficients for horizontally submerged rectangular cylinders in waves and currents

The results of an experimental investigation carried out to measure combined wave and current loads on horizontally submerged square and rectangular cylinders are reported in this paper. The wave and current induced forces on a section of the cylinders with breadth-depth (aspect) ratios equal to 1, 0.5, and 0.75 are measured in a wave tank. The maximum value of Keulegan-Carpenter (KC) number obtained in waves alone is about 5 and Reynolds (Re) number ranged from 6.3976103 to 1.186105. The drag (CD) and inertia (CM) coefficients for each cylinder are evaluated using measured sectional wave forces and particle kinematics calculated from linear wave theory. The values of CD and CM obtained for waves alone have already been reported (Venugopal, V., Varyani, K. S., and Barltrop, N. D. P. Wave force coefficients for horizontally submerged rectangular cylinders. Ocean Engineering, 2006, 33, 11-12, 1669-1704) and the coefficients derived in combined waves and currents are presented here. The results indicate that both drag and inertia coefficients are strongly affected by the presenceof the current and show different trends for different cylinders. The values of the vertical component inertia coefficients (CMY) in waves and currents are generally smaller than the inertia coefficients obtained in waves alone, irrespective of the current's magnitude and direction. The results also illustrate the effect of a cylinder's aspect ratio on force coefficients. This study will be useful in the design of offshore structures whose columns and caissons are rectangular sections

Sensor Management for Tracking in Sensor Networks

We study the problem of tracking an object moving through a network of wireless sensors. In order to conserve energy, the sensors may be put into a sleep mode with a timer that determines their sleep duration. It is assumed that an asleep sensor cannot be communicated with or woken up, and hence the sleep duration needs to be determined at the time the sensor goes to sleep based on all the information available to the sensor. Having sleeping sensors in the network could result in degraded tracking performance, therefore, there is a tradeoff between energy usage and tracking performance. We design sleeping policies that attempt to optimize this tradeoff and characterize their performance. As an extension to our previous work in this area [1], we consider generalized models for object movement, object sensing, and tracking cost. For discrete state spaces and continuous Gaussian observations, we derive a lower bound on the optimal energy-tracking tradeoff. It is shown that in the low tracking error regime, the generated policies approach the derived lower bound

Sensor Scheduling for Energy-Efficient Target Tracking in Sensor Networks

In this paper we study the problem of tracking an object moving randomly through a network of wireless sensors. Our objective is to devise strategies for scheduling the sensors to optimize the tradeoff between tracking performance and energy consumption. We cast the scheduling problem as a Partially Observable Markov Decision Process (POMDP), where the control actions correspond to the set of sensors to activate at each time step. Using a bottom-up approach, we consider different sensing, motion and cost models with increasing levels of difficulty. At the first level, the sensing regions of the different sensors do not overlap and the target is only observed within the sensing range of an active sensor. Then, we consider sensors with overlapping sensing range such that the tracking error, and hence the actions of the different sensors, are tightly coupled. Finally, we consider scenarios wherein the target locations and sensors' observations assume values on continuous spaces. Exact solutions are generally intractable even for the simplest models due to the dimensionality of the information and action spaces. Hence, we devise approximate solution techniques, and in some cases derive lower bounds on the optimal tradeoff curves. The generated scheduling policies, albeit suboptimal, often provide close-to-optimal energy-tracking tradeoffs